Fault-Tolerant Multi-Agent Exact Belief Propagation
نویسندگان
چکیده
Multiply sectioned Bayesian networks (MSBNs) support multiagent probabilistic inference in distributed large problem domains, where agents (subdomains) are organized by a tree structure (called hypertree). In earlier work, all belief updating methods on a hypertree are made of two rounds of propagation, each of which is implemented as a recursive process. Both processes need to be started from the same designated (root) hypernode. Agents perform local belief updating at most in a partial parallel manner. Such methods may not be suitable for practical multiagent environments since they are easy to crush for the problems happened in communication or local belief updating. In this paper, we present a fault-tolerant belief updating method for multiagent probabilistic inference. In this method, multiple agents concurrently perform exact belief updating in a complete parallel. Temporary problems happened from time to time at some agents or some communication channels would not prevent agents from eventually converging to the correct beliefs. Permanently disconnected communication channels would not keep the properly connected portions of the system from appropriately finishing their belief updating within portions. Compared to the previous traversal-based belief updating, the proposed approach is not only fault-tolerant but also robust and scalable.
منابع مشابه
Mathematical Programs for Belief Propagation and Consensus
This paper develops methods of distributed Bayesian hypothesis tests for fault detection and diagnosis that are based on belief propagation and optimization in graphical models. The main challenges in developing distributed statistical estimation algorithms are i) difficulties in ensuring convergence and consensus for solutions of distributed inference problems, ii) increasing computational cos...
متن کاملSystematic Methods to Evaluate Fault-Tolerant Behavior of Nanoscale Circuits
This paper focuses on the investigation of efficient methods to evaluate circuit fault-tolerance. We propose a fault-tolerance evaluation method based on the Belief Propagation (BP) algorithm. Compared with existing approaches, our algorithm is more efficient in terms of memory requirements and CPU time. The algorithm can easily run on multiple CPUs to achieve parallel processing, and thus furt...
متن کاملBelief Propagation for Structured Decision Making
Variational inference algorithms such as belief propagation have had tremendous impact on our ability to learn and use graphical models, and give many insights for developing or understanding exact and approximate inference. However, variational approaches have not been widely adoped for decision making in graphical models, often formulated through influence diagrams and including both centrali...
متن کاملLos Alamos RELIABILITY ANALYSIS OF FAULT - TOLERANT RECONFIGURABLE NANO - ARCHITECTURE
Manufacturing defects and transient errors will be abundant in high density reconfigurable nano-scale designs . Recently, we have automated a computational scheme based on Markov Random Field (MRF) and Belief Propagation algorithms in a tool named NANOLAB to evaluate the reliabili ty of nano architectures . In this paper, we show how our methodology can be exploited to design defectand fault-to...
متن کاملDistributed Adaptive Fault-Tolerant Control of Uncertain Multi-Agent Systems
This paper presents an adaptive fault-tolerant control (FTC) scheme for a class of nonlinear uncertain multi-agent systems. A local FTC scheme is designed for each agent using local measurements and suitable information exchanged between neighboring agents. Each local FTC scheme consists of a fault diagnosis module and a reconfigurable controller module comprised of a baseline controller and tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computational Intelligence
دوره 25 شماره
صفحات -
تاریخ انتشار 2009